CAN Tree Routing for Content-Addressable Network

We propose a novel topology to improve the routing performance of Content-Addressable Network overlays while minimizing the maintenance overhead during nodes churn. The key idea of our approach is to establish a P2P tree structure (CAN tree) by means of equipping each node with a few long links towards some distant nodes. The long links enhance routing flexibility and robustness against failures. Nodes automatically adapt routing table to cope with network change. The routing complexity is O(log n), which is much better than a uniform greedy routing, while each node maintains two long links in average. Copyright © 2014 IFSA Publishing, S. L.